Optimal M-BCJR Turbo Decoding: The Z-MAP Algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal M-BCJR Turbo Decoding: The Z-MAP Algorithm

In this paper, we propose a novel idea for improvement performances of the leader M-BCJR algorithm functioning in low complexity. The basic idea consists to localize error instant possibility, and then increase the complexity around this moment. We also propose an easy and important idea for early localisation of erroneous moments. We call this new algorithm Z-MAP. The simulations show that the...

متن کامل

Performance Limits of Turbo Equalization Using M-BCJR Algorithm

We study the performance limits of turbo equalization when the M -BCJR algorithm is used as the soft-in soft-out equalizer. We show through analysis based on EXIT charts that the M -BCJR equalizer can provide performance very close to that of the BCJR equalizer with considerably reduced complexity. We show that the current practice of using the output of the equalizer directly as a posteriori p...

متن کامل

Low-Complexity MAP Decoding for Turbo Codes

Two simplified MAP algorithms for iterative decoding of turbo codes are presented. By using a parameter “decoding depth”, our algorithms do not require computation of the aposteriori probability of each decoded information bit throughout the entire trellis, thus reduce the computational complexity and decoding delay considerably. One of the algorithms can achieve the performance very close to t...

متن کامل

Concatenated Decoding with a Reduced-Search BCJR Algorithm

We apply two reduced-computation variants of the BCJR algorithm to the decoding of serial and parallel concatenated convolutional codes. One computes its recursions at only M states per trellis stage; one computes only at states with values above a threshold. The threshold scheme is much more efficient, and it greatly reduces the computation of the BCJR algorithm. By computing only when the cha...

متن کامل

Nonlinear Phenomena in the Turbo Decoding Algorithm

In this paper, we treat the turbo decoding algorithm as a dynamical system parameterized by a single parameter that closely approximates the signal-to-noise ratio (SNR). A whole range of phenomena known to occur in nonlinear systems, like the existence of multiple fixed points, oscillatory behavior, bifurcations, chaos and transient chaos are found in the turbo decoding algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Wireless Engineering and Technology

سال: 2011

ISSN: 2152-2294,2152-2308

DOI: 10.4236/wet.2011.24031